Polynomial and rational inequalities on analytic Jordan arcs and domains

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Basic Polynomial Inequalities on Intervals and Circular Arcs

We prove the right Lax-type inequality on subarcs of the unit circle of the complex plane for complex algebraic polynomials of degree n having no zeros in the open unit disk. This is done by establishing the right Bernstein-Szegő-Videnskii type inequality for real trigonometric polynomials of degree at most n on intervals shorter than the period. The paper is closely related to recent work by B...

متن کامل

Markov-type inequalities on certain irrational arcs and domains

Let Pd n denote the set of real algebraic polynomials of d variables and of total degree at most n. For a compact set K ⊂ Rd set ‖P‖K = sup x∈K |P (x)| . Then the Markov factors on K are defined by Mn(K) := max n ‖DωP‖K : P ∈ Pd n, ‖P‖K ≤ 1 , ω ∈ Sd−1 o . (Here, as usual, Sd−1 stands for the Eucledean unit sphere in Rd .) Furthermore, given a smooth curve Γ ⊂ Rd , we denote by DT P the tangenti...

متن کامل

On Bernstein Type Inequalities for Complex Polynomial

In this paper, we establish some Bernstein type inequalities for the complex polynomial. Our results constitute generalizations and refinements of some well-known polynomial inequalities.

متن کامل

Semistar dimension of polynomial rings and Prufer-like domains

Let $D$ be an integral domain and $star$ a semistar operation stable and of finite type on it. We define the semistar dimension (inequality) formula and discover their relations with $star$-universally catenarian domains and $star$-stably strong S-domains. As an application, we give new characterizations of $star$-quasi-Pr"{u}fer domains and UM$t$ domains in terms of dimension inequal...

متن کامل

Self-testing Polynomial Functions Eeciently and over Rational Domains

In this paper we give the rst self-testers and checkers for polynomials over rational and integer domains. We also show signiicantly stronger bounds on the eeciency of a simple modiication of the algorithm for self-testing polynomials over nite elds given in 8].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 2015

ISSN: 0022-247X

DOI: 10.1016/j.jmaa.2015.05.022